________________________________________________________________

Run Header: Complete YList Version try 5: /small pw steps

Run start:        03.02.2010 21:11:03
Input Data from:  dataset152.txt
Iteration limit:  500
NI iter. limit:   200

# of Customers  :200
# of Locations  :20
Ex.Facilities   :2
Total budget    :25000
Terror. attacks :2

Penalty Weight : 0,5
Update Policy  : 4-3 of last 10
pw inc. step   : 0,005

Coverage Ratio :0,1775
Average f[i]   :4750
Average g[i,j] :1977,77777777778
Total demand   :10740
________________________________________________________________

## ITERATION 0 #######################


> Neighbours evaluated; 19
> Selected Move:	2760	1	-1	6	4000


> New Y[]: 
	
	 2  3  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0    >new incumb.: 2760


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 1 #######################


> Neighbours evaluated; 69
> Selected Move:	3200	1	-1	2	10000


> New Y[]: 
	
	 2  3  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0    >new incumb.: 3200


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 2 #######################


> Neighbours evaluated; 53
> Selected Move:	3880	1	-1	3	16000


> New Y[]: 
	
	 2  3  1  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0    >new incumb.: 3880


> New S[]: 
	
	 0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 3 #######################


> Neighbours evaluated; 67
> Selected Move:	5010	1	-1	4	21500


> New Y[]: 
	
	 2  3  1  1  1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0    >new incumb.: 5010


> New S[]: 
	
	 0  0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 4 #######################


> Neighbours evaluated; 79
> Selected Move:	5960	3	0	12	23200


> New Y[]: 
	
	 0  3  1  1  1  0  1  0  0  0  0  0  2  0  0  0  0  0  0  0    >new incumb.: 5960


> New S[]: 
	
	 0  1  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 5 #######################


> Neighbours evaluated; 87
> Selected Move:	6010	3	4	13	23700


> New Y[]: 
	
	 0  3  1  1  0  0  1  0  0  0  0  0  2  1  0  0  0  0  0  0    >new incumb.: 6010


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  1  1  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 6 #######################


> Neighbours evaluated; 43
> Selected Move:	6180	3	6	5	24200


> New Y[]: 
	
	 0  3  1  1  0  1  0  0  0  0  0  0  2  1  0  0  0  0  0  0    >new incumb.: 6180


> New S[]: 
	
	 0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,495

## ITERATION 7 #######################


> Neighbours evaluated; 67
> Selected Move:	6280	3	12	10	24600


> New Y[]: 
	
	 0  3  1  1  0  1  0  0  0  0  2  0  0  1  0  0  0  0  0  0    >new incumb.: 6280


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0 
 > pw :0,49

## ITERATION 8 #######################


> Neighbours evaluated; 72
> Selected Move:	6280	4	10	2	22000


> New Y[]: 
	
	 0  3  2  1  0  1  0  0  0  0  1  0  0  1  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0 
 > pw :0,485

## ITERATION 9 #######################


> Neighbours evaluated; 80
> Selected Move:	6515	1	-1	16	26000


> New Y[]: 
	
	 0  3  2  1  0  1  0  0  0  0  1  0  0  1  0  0  1  0  0  0 


> New S[]: 
	
	 0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,48

## ITERATION 10 #######################


> Neighbours evaluated; 65
> Selected Move:	6760	3	3	7	25500


> New Y[]: 
	
	 0  3  2  0  0  1  0  1  0  0  1  0  0  1  0  0  1  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,475

## ITERATION 11 #######################


> Neighbours evaluated; 59
> Selected Move:	6880	3	5	6	25000


> New Y[]: 
	
	 0  3  2  0  0  0  1  1  0  0  1  0  0  1  0  0  1  0  0  0    >new incumb.: 6880


> New S[]: 
	
	 0  0  1  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,47

## ITERATION 12 #######################


> Neighbours evaluated; 69
> Selected Move:	6692	4	2	13	25400


> New Y[]: 
	
	 0  3  1  0  0  0  1  1  0  0  1  0  0  2  0  0  1  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,465

## ITERATION 13 #######################


> Neighbours evaluated; 61
> Selected Move:	6760	3	2	8	23900


> New Y[]: 
	
	 0  3  0  0  0  0  1  1  1  0  1  0  0  2  0  0  1  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0  1  0  0  0  0  0  0  0  0  0 
 > pw :0,46

## ITERATION 14 #######################


> Neighbours evaluated; 76
> Selected Move:	6780	3	6	5	24400


> New Y[]: 
	
	 0  3  0  0  0  1  0  1  1  0  1  0  0  2  0  0  1  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,455

## ITERATION 15 #######################


> Neighbours evaluated; 72
> Selected Move:	6850	3	7	3	24900


> New Y[]: 
	
	 0  3  0  1  0  1  0  0  1  0  1  0  0  2  0  0  1  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,45

## ITERATION 16 #######################


> Neighbours evaluated; 75
> Selected Move:	6850	4	13	3	24900


> New Y[]: 
	
	 0  3  0  2  0  1  0  0  1  0  1  0  0  1  0  0  1  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,445

## ITERATION 17 #######################


> Neighbours evaluated; 85
> Selected Move:	6780	3	3	11	24900


> New Y[]: 
	
	 0  3  0  0  0  1  0  0  1  0  1  2  0  1  0  0  1  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,44

## ITERATION 18 #######################


> Neighbours evaluated; 65
> Selected Move:	6780	4	11	13	24900


> New Y[]: 
	
	 0  3  0  0  0  1  0  0  1  0  1  1  0  2  0  0  1  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,435

## ITERATION 19 #######################


> Neighbours evaluated; 70
> Selected Move:	6760	3	5	6	24400


> New Y[]: 
	
	 0  3  0  0  0  0  1  0  1  0  1  1  0  2  0  0  1  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  1  1  0  0  0  0  0  0  0  0 
 > pw :0,43

## ITERATION 20 #######################


> Neighbours evaluated; 72
> Selected Move:	6760	4	13	11	24400


> New Y[]: 
	
	 0  3  0  0  0  0  1  0  1  0  1  2  0  1  0  0  1  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  1  1  0  0  0  0  0  0  0  0 
 > pw :0,425

## ITERATION 21 #######################


> Neighbours evaluated; 77
> Selected Move:	6760	3	11	3	24400


> New Y[]: 
	
	 0  3  0  2  0  0  1  0  1  0  1  0  0  1  0  0  1  0  0  0 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0 
 > pw :0,42

## ITERATION 22 #######################


> Neighbours evaluated; 84
> Selected Move:	6760	4	3	13	24400


> New Y[]: 
	
	 0  3  0  1  0  0  1  0  1  0  1  0  0  2  0  0  1  0  0  0 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0 
 > pw :0,415

## ITERATION 23 #######################


> Neighbours evaluated; 84
> Selected Move:	6720	3	3	14	24400


> New Y[]: 
	
	 0  3  0  0  0  0  1  0  1  0  1  0  0  2  1  0  1  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,41

## ITERATION 24 #######################


> Neighbours evaluated; 85
> Selected Move:	6720	4	13	14	24600


> New Y[]: 
	
	 0  3  0  0  0  0  1  0  1  0  1  0  0  1  2  0  1  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,405

## ITERATION 25 #######################


> Neighbours evaluated; 80
> Selected Move:	6760	3	14	7	24700


> New Y[]: 
	
	 0  3  0  0  0  0  1  2  1  0  1  0  0  1  0  0  1  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0  1  0  0  0  0  0  0  0  0  0 
 > pw :0,4

## ITERATION 26 #######################


> Neighbours evaluated; 72
> Selected Move:	6700	3	6	5	25200


> New Y[]: 
	
	 0  3  0  0  0  1  0  2  1  0  1  0  0  1  0  0  1  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,395

## ITERATION 27 #######################


> Neighbours evaluated; 70
> Selected Move:	6681	3	7	14	25100


> New Y[]: 
	
	 0  3  0  0  0  1  0  0  1  0  1  0  0  1  2  0  1  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,39

## ITERATION 28 #######################


> Neighbours evaluated; 74
> Selected Move:	6720	4	14	13	24900


> New Y[]: 
	
	 0  3  0  0  0  1  0  0  1  0  1  0  0  2  1  0  1  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,385

## ITERATION 29 #######################


> Neighbours evaluated; 87
> Selected Move:	6500	3	5	18	24900


> New Y[]: 
	
	 0  3  0  0  0  0  0  0  1  0  1  0  0  2  1  0  1  0  1  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0 
 > pw :0,38

## ITERATION 30 #######################


> Neighbours evaluated; 98
> Selected Move:	6500	3	14	3	24900


> New Y[]: 
	
	 0  3  0  1  0  0  0  0  1  0  1  0  0  2  0  0  1  0  1  0 


> New S[]: 
	
	 0  1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,375

## ITERATION 31 #######################


> Neighbours evaluated; 100
> Selected Move:	6500	4	13	3	24900


> New Y[]: 
	
	 0  3  0  2  0  0  0  0  1  0  1  0  0  1  0  0  1  0  1  0 


> New S[]: 
	
	 0  1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,37

## ITERATION 32 #######################


> Neighbours evaluated; 102
> Selected Move:	6500	3	3	11	24900


> New Y[]: 
	
	 0  3  0  0  0  0  0  0  1  0  1  2  0  1  0  0  1  0  1  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0 
 > pw :0,365

## ITERATION 33 #######################


> Neighbours evaluated; 96
> Selected Move:	6500	4	11	13	24900


> New Y[]: 
	
	 0  3  0  0  0  0  0  0  1  0  1  1  0  2  0  0  1  0  1  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0 
 > pw :0,36

## ITERATION 34 #######################


> Neighbours evaluated; 98
> Selected Move:	6500	3	11	7	24400


> New Y[]: 
	
	 0  3  0  0  0  0  0  1  1  0  1  0  0  2  0  0  1  0  1  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,355

## ITERATION 35 #######################


> Neighbours evaluated; 99
> Selected Move:	6491	3	8	2	25900


> New Y[]: 
	
	 0  3  1  0  0  0  0  1  0  0  1  0  0  2  0  0  1  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0  1  0  0  0  0  0  0  0  0  0 
 > pw :0,35

## ITERATION 36 #######################


> Neighbours evaluated; 88
> Selected Move:	6685	3	18	5	25900


> New Y[]: 
	
	 0  3  1  0  0  1  0  1  0  0  1  0  0  2  0  0  1  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,345

## ITERATION 37 #######################


> Neighbours evaluated; 79
> Selected Move:	6530	3	2	9	25900


> New Y[]: 
	
	 0  3  0  0  0  1  0  1  0  1  1  0  0  2  0  0  1  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,34

## ITERATION 38 #######################


> Neighbours evaluated; 72
> Selected Move:	6704	3	5	6	25400


> New Y[]: 
	
	 0  3  0  0  0  0  1  1  0  1  1  0  0  2  0  0  1  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,335

## ITERATION 39 #######################


> Neighbours evaluated; 75
> Selected Move:	6639	4	13	9	25600


> New Y[]: 
	
	 0  3  0  0  0  0  1  1  0  2  1  0  0  1  0  0  1  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,34

## ITERATION 40 #######################


> Neighbours evaluated; 79
> Selected Move:	6506	3	7	14	26100


> New Y[]: 
	
	 0  3  0  0  0  0  1  0  0  2  1  0  0  1  1  0  1  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1  0  0  0  0  1  0  0  0  0  0 
 > pw :0,345

## ITERATION 41 #######################


> Neighbours evaluated; 83
> Selected Move:	6708	3	9	2	25500


> New Y[]: 
	
	 0  3  2  0  0  0  1  0  0  0  1  0  0  1  1  0  1  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0 
 > pw :0,35

## ITERATION 42 #######################


> Neighbours evaluated; 85
> Selected Move:	6705	3	14	11	25500


> New Y[]: 
	
	 0  3  2  0  0  0  1  0  0  0  1  1  0  1  0  0  1  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0 
 > pw :0,355

## ITERATION 43 #######################


> Neighbours evaluated; 75
> Selected Move:	6645	3	6	5	26000


> New Y[]: 
	
	 0  3  2  0  0  1  0  0  0  0  1  1  0  1  0  0  1  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0 
 > pw :0,36

## ITERATION 44 #######################


> Neighbours evaluated; 82
> Selected Move:	6640	3	11	14	26000


> New Y[]: 
	
	 0  3  2  0  0  1  0  0  0  0  1  0  0  1  1  0  1  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0 
 > pw :0,365

## ITERATION 45 #######################


> Neighbours evaluated; 85
> Selected Move:	6610	3	14	12	25000


> New Y[]: 
	
	 0  3  2  0  0  1  0  0  0  0  1  0  1  1  0  0  1  0  0  0 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,37

## ITERATION 46 #######################


> Neighbours evaluated; 101
> Selected Move:	6530	3	5	6	24500


> New Y[]: 
	
	 0  3  2  0  0  0  1  0  0  0  1  0  1  1  0  0  1  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,375

## ITERATION 47 #######################


> Neighbours evaluated; 92
> Selected Move:	6603	3	12	3	25500


> New Y[]: 
	
	 0  3  2  1  0  0  1  0  0  0  1  0  0  1  0  0  1  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  1  0  0  1  0  0  0  0  0  0 
 > pw :0,38

## ITERATION 48 #######################


> Neighbours evaluated; 83
> Selected Move:	6448	4	2	3	25900


> New Y[]: 
	
	 0  3  1  2  0  0  1  0  0  0  1  0  0  1  0  0  1  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  1  0  0  1  0  0  0  0  0  0 
 > pw :0,385

## ITERATION 49 #######################


> Neighbours evaluated; 78
> Selected Move:	6534	3	3	11	25900


> New Y[]: 
	
	 0  3  1  0  0  0  1  0  0  0  1  2  0  1  0  0  1  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0 
 > pw :0,39

## ITERATION 50 #######################


> Neighbours evaluated; 66
> Selected Move:	6529	4	11	13	25900


> New Y[]: 
	
	 0  3  1  0  0  0  1  0  0  0  1  1  0  2  0  0  1  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0 
 > pw :0,395

## ITERATION 51 #######################


> Neighbours evaluated; 70
> Selected Move:	6530	3	11	12	24900


> New Y[]: 
	
	 0  3  1  0  0  0  1  0  0  0  1  0  1  2  0  0  1  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,4

## ITERATION 52 #######################


> Neighbours evaluated; 88
> Selected Move:	6530	3	2	3	24900


> New Y[]: 
	
	 0  3  0  1  0  0  1  0  0  0  1  0  1  2  0  0  1  0  0  0 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,405

## ITERATION 53 #######################


> Neighbours evaluated; 93
> Selected Move:	6530	4	13	3	24900


> New Y[]: 
	
	 0  3  0  2  0  0  1  0  0  0  1  0  1  1  0  0  1  0  0  0 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,41

## ITERATION 54 #######################


> Neighbours evaluated; 95
> Selected Move:	6489	3	3	9	25100


> New Y[]: 
	
	 0  3  0  0  0  0  1  0  0  2  1  0  1  1  0  0  1  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0 
 > pw :0,415

## ITERATION 55 #######################


> Neighbours evaluated; 92
> Selected Move:	6530	4	9	13	24900


> New Y[]: 
	
	 0  3  0  0  0  0  1  0  0  1  1  0  1  2  0  0  1  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0 
 > pw :0,42

## ITERATION 56 #######################


> Neighbours evaluated; 95
> Selected Move:	6502	3	12	14	25900


> New Y[]: 
	
	 0  3  0  0  0  0  1  0  0  1  1  0  0  2  1  0  1  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1  0  0  0  0  1  0  0  0  0  0 
 > pw :0,425

## ITERATION 57 #######################


> Neighbours evaluated; 81
> Selected Move:	6498	3	9	2	25900


> New Y[]: 
	
	 0  3  1  0  0  0  1  0  0  0  1  0  0  2  1  0  1  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0 
 > pw :0,43

## ITERATION 58 #######################


> Neighbours evaluated; 79
> Selected Move:	6407	4	13	14	26100


> New Y[]: 
	
	 0  3  1  0  0  0  1  0  0  0  1  0  0  1  2  0  1  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0 
 > pw :0,435

## ITERATION 59 #######################


> Neighbours evaluated; 79
> Selected Move:	6402	3	2	9	26100


> New Y[]: 
	
	 0  3  0  0  0  0  1  0  0  1  1  0  0  1  2  0  1  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1  0  0  0  0  1  0  0  0  0  0 
 > pw :0,44

## ITERATION 60 #######################


> Neighbours evaluated; 84
> Selected Move:	6444	3	14	11	25900


> New Y[]: 
	
	 0  3  0  0  0  0  1  0  0  1  1  2  0  1  0  0  1  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,445

## ITERATION 61 #######################


> Neighbours evaluated; 69
> Selected Move:	6440	4	11	13	25900


> New Y[]: 
	
	 0  3  0  0  0  0  1  0  0  1  1  1  0  2  0  0  1  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,45

## ITERATION 62 #######################


> Neighbours evaluated; 69
> Selected Move:	6385	3	11	3	25900


> New Y[]: 
	
	 0  3  0  1  0  0  1  0  0  1  1  0  0  2  0  0  1  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  1  0  0  1  0  0  0  0  0  0 
 > pw :0,455

## ITERATION 63 #######################


> Neighbours evaluated; 71
> Selected Move:	6381	4	13	3	25900


> New Y[]: 
	
	 0  3  0  2  0  0  1  0  0  1  1  0  0  1  0  0  1  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  1  0  0  1  0  0  0  0  0  0 
 > pw :0,46

## ITERATION 64 #######################


> Neighbours evaluated; 74
> Selected Move:	6288	3	3	7	26200


> New Y[]: 
	
	 0  3  0  0  0  0  1  2  0  1  1  0  0  1  0  0  1  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,465

## ITERATION 65 #######################


> Neighbours evaluated; 62
> Selected Move:	6322	3	9	2	26200


> New Y[]: 
	
	 0  3  1  0  0  0  1  2  0  0  1  0  0  1  0  0  1  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,47

## ITERATION 66 #######################


> Neighbours evaluated; 65
> Selected Move:	6226	3	13	12	25200


> New Y[]: 
	
	 0  3  1  0  0  0  1  2  0  0  1  0  1  0  0  0  1  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,475

## ITERATION 67 #######################


> Neighbours evaluated; 78
> Selected Move:	6330	3	7	3	24900


> New Y[]: 
	
	 0  3  1  2  0  0  1  0  0  0  1  0  1  0  0  0  1  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,48

## ITERATION 68 #######################


> Neighbours evaluated; 77
> Selected Move:	6330	4	3	2	24500


> New Y[]: 
	
	 0  3  2  1  0  0  1  0  0  0  1  0  1  0  0  0  1  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,485

## ITERATION 69 #######################


> Neighbours evaluated; 79
> Selected Move:	6440	3	12	4	25000


> New Y[]: 
	
	 0  3  2  1  1  0  1  0  0  0  1  0  0  0  0  0  1  0  0  0 


> New S[]: 
	
	 0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,49

## ITERATION 70 #######################


> Neighbours evaluated; 88
> Selected Move:	6440	3	3	7	24500


> New Y[]: 
	
	 0  3  2  0  1  0  1  1  0  0  1  0  0  0  0  0  1  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,495

## ITERATION 71 #######################


> Neighbours evaluated; 75
> Selected Move:	6680	3	6	5	25000


> New Y[]: 
	
	 0  3  2  0  1  1  0  1  0  0  1  0  0  0  0  0  1  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 72 #######################


> Neighbours evaluated; 87
> Selected Move:	6430	3	7	11	25500


> New Y[]: 
	
	 0  3  2  0  1  1  0  0  0  0  1  1  0  0  0  0  1  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0 
 > pw :0,505

## ITERATION 73 #######################


> Neighbours evaluated; 76
> Selected Move:	6440	3	5	6	25000


> New Y[]: 
	
	 0  3  2  0  1  0  1  0  0  0  1  1  0  0  0  0  1  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 74 #######################


> Neighbours evaluated; 78
> Selected Move:	6440	3	11	14	25000


> New Y[]: 
	
	 0  3  2  0  1  0  1  0  0  0  1  0  0  0  1  0  1  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0 
 > pw :0,495

## ITERATION 75 #######################


> Neighbours evaluated; 78
> Selected Move:	6432	3	6	5	25500


> New Y[]: 
	
	 0  3  2  0  1  1  0  0  0  0  1  0  0  0  1  0  1  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0 
 > pw :0,49

## ITERATION 76 #######################


> Neighbours evaluated; 81
> Selected Move:	6355	3	14	3	25500


> New Y[]: 
	
	 0  3  2  1  1  1  0  0  0  0  1  0  0  0  0  0  1  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,485

## ITERATION 77 #######################


> Neighbours evaluated; 92
> Selected Move:	6330	3	4	12	25000


> New Y[]: 
	
	 0  3  2  1  0  1  0  0  0  0  1  0  1  0  0  0  1  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,48

## ITERATION 78 #######################


> Neighbours evaluated; 80
> Selected Move:	6338	3	2	13	25400


> New Y[]: 
	
	 0  3  0  1  0  1  0  0  0  0  1  0  1  2  0  0  1  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,475

## ITERATION 79 #######################


> Neighbours evaluated; 90
> Selected Move:	6420	3	3	2	25400


> New Y[]: 
	
	 0  3  1  0  0  1  0  0  0  0  1  0  1  2  0  0  1  0  0  0 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,48

## ITERATION 80 #######################


> Neighbours evaluated; 91
> Selected Move:	6418	3	2	9	25400


> New Y[]: 
	
	 0  3  0  0  0  1  0  0  0  1  1  0  1  2  0  0  1  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0 
 > pw :0,485

## ITERATION 81 #######################


> Neighbours evaluated; 91
> Selected Move:	6380	3	9	19	24900


> New Y[]: 
	
	 0  3  0  0  0  1  0  0  0  0  1  0  1  2  0  0  1  0  0  1 


> New S[]: 
	
	 0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,49

## ITERATION 82 #######################


> Neighbours evaluated; 83
> Selected Move:	6804	3	16	8	25400


> New Y[]: 
	
	 0  3  0  0  0  1  0  0  1  0  1  0  1  2  0  0  0  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0  0  0  0 
 > pw :0,495

## ITERATION 83 #######################


> Neighbours evaluated; 62
> Selected Move:	6720	3	5	6	24900


> New Y[]: 
	
	 0  3  0  0  0  0  1  0  1  0  1  0  1  2  0  0  0  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  1  0  0  1  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 84 #######################


> Neighbours evaluated; 82
> Selected Move:	6480	3	13	4	25200


> New Y[]: 
	
	 0  3  0  0  2  0  1  0  1  0  1  0  1  0  0  0  0  0  0  1 


> New S[]: 
	
	 0  1  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,505

## ITERATION 85 #######################


> Neighbours evaluated; 58
> Selected Move:	6530	4	4	19	25100


> New Y[]: 
	
	 0  3  0  0  1  0  1  0  1  0  1  0  1  0  0  0  0  0  0  2 


> New S[]: 
	
	 0  1  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,51

## ITERATION 86 #######################


> Neighbours evaluated; 64
> Selected Move:	6490	3	19	0	23000


> New Y[]: 
	
	 2  3  0  0  1  0  1  0  1  0  1  0  1  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,515

## ITERATION 87 #######################


> Neighbours evaluated; 63
> Selected Move:	6780	3	6	5	23500


> New Y[]: 
	
	 2  3  0  0  1  1  0  0  1  0  1  0  1  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,52

## ITERATION 88 #######################


> Neighbours evaluated; 77
> Selected Move:	6780	3	8	2	25000


> New Y[]: 
	
	 2  3  1  0  1  1  0  0  0  0  1  0  1  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,525

## ITERATION 89 #######################


> Neighbours evaluated; 57
> Selected Move:	6780	3	2	3	25000


> New Y[]: 
	
	 2  3  0  1  1  1  0  0  0  0  1  0  1  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,52

## ITERATION 90 #######################


> Neighbours evaluated; 75
> Selected Move:	6780	3	3	9	25000


> New Y[]: 
	
	 2  3  0  0  1  1  0  0  0  1  1  0  1  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1  0  0  1  0  0  0  0  0  0  0 
 > pw :0,515

## ITERATION 91 #######################


> Neighbours evaluated; 78
> Selected Move:	6610	3	9	11	25000


> New Y[]: 
	
	 2  3  0  0  1  1  0  0  0  0  1  1  1  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0 
 > pw :0,51

## ITERATION 92 #######################


> Neighbours evaluated; 78
> Selected Move:	6570	3	11	7	24500


> New Y[]: 
	
	 2  3  0  0  1  1  0  1  0  0  1  0  1  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0 
 > pw :0,505

## ITERATION 93 #######################


> Neighbours evaluated; 82
> Selected Move:	6570	3	4	13	25000


> New Y[]: 
	
	 2  3  0  0  0  1  0  1  0  0  1  0  1  1  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  1  0  0  1  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 94 #######################


> Neighbours evaluated; 70
> Selected Move:	6640	3	7	8	24000


> New Y[]: 
	
	 2  3  0  0  0  1  0  0  1  0  1  0  1  1  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0  0  0  0 
 > pw :0,495

## ITERATION 95 #######################


> Neighbours evaluated; 76
> Selected Move:	6640	3	12	14	25000


> New Y[]: 
	
	 2  3  0  0  0  1  0  0  1  0  1  0  0  1  1  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  1  0  0  0  1  0  0  0  0  0 
 > pw :0,49

## ITERATION 96 #######################


> Neighbours evaluated; 66
> Selected Move:	6780	3	13	4	24500


> New Y[]: 
	
	 2  3  0  0  1  1  0  0  1  0  1  0  0  0  1  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0  0  0  0  0  1  0  0  0  0  0 
 > pw :0,485

## ITERATION 97 #######################


> Neighbours evaluated; 79
> Selected Move:	6490	3	5	6	24000


> New Y[]: 
	
	 2  3  0  0  1  0  1  0  1  0  1  0  0  0  1  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0  0  0  0  0  1  0  0  0  0  0 
 > pw :0,48

## ITERATION 98 #######################


> Neighbours evaluated; 72
> Selected Move:	6520	3	4	13	24500


> New Y[]: 
	
	 2  3  0  0  0  0  1  0  1  0  1  0  0  1  1  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  1  0  0  0  1  0  0  0  0  0 
 > pw :0,475

## ITERATION 99 #######################


> Neighbours evaluated; 69
> Selected Move:	6720	3	6	16	24500


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  1  0  1  0  0  1  1  0  1  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,47

## ITERATION 100 #######################


> Neighbours evaluated; 100
> Selected Move:	6730	3	14	7	24000


> New Y[]: 
	
	 2  3  0  0  0  0  0  1  1  0  1  0  0  1  0  0  1  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0  1  0  0  0  0  0  0  0  0  0 
 > pw :0,465

## ITERATION 101 #######################


> Neighbours evaluated; 89
> Selected Move:	6730	3	7	11	24500


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  1  0  1  1  0  1  0  0  1  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  1  1  0  0  0  0  0  0  0  0 
 > pw :0,46

## ITERATION 102 #######################


> Neighbours evaluated; 97
> Selected Move:	6600	3	11	3	24500


> New Y[]: 
	
	 2  3  0  1  0  0  0  0  1  0  1  0  0  1  0  0  1  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  1  0  0  1  0  0  0  0  0  0 
 > pw :0,455

## ITERATION 103 #######################


> Neighbours evaluated; 88
> Selected Move:	6530	3	8	12	25000


> New Y[]: 
	
	 2  3  0  1  0  0  0  0  0  0  1  0  1  1  0  0  1  0  0  0 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,45

## ITERATION 104 #######################


> Neighbours evaluated; 95
> Selected Move:	6575	3	16	5	25500


> New Y[]: 
	
	 2  3  0  1  0  1  0  0  0  0  1  0  1  1  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,445

## ITERATION 105 #######################


> Neighbours evaluated; 70
> Selected Move:	6578	3	3	9	25500


> New Y[]: 
	
	 2  3  0  0  0  1  0  0  0  1  1  0  1  1  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0 
 > pw :0,44

## ITERATION 106 #######################


> Neighbours evaluated; 73
> Selected Move:	6530	3	5	16	25000


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  0  1  1  0  1  1  0  0  1  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0 
 > pw :0,435

## ITERATION 107 #######################


> Neighbours evaluated; 101
> Selected Move:	6613	3	12	7	25500


> New Y[]: 
	
	 2  3  0  0  0  0  0  1  0  1  1  0  0  1  0  0  1  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  1  0  0  1  0  0  0  0  0  0 
 > pw :0,43

## ITERATION 108 #######################


> Neighbours evaluated; 83
> Selected Move:	6595	3	9	2	25500


> New Y[]: 
	
	 2  3  1  0  0  0  0  1  0  0  1  0  0  1  0  0  1  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0  1  0  0  0  0  0  0  0  0  0 
 > pw :0,425

## ITERATION 109 #######################


> Neighbours evaluated; 82
> Selected Move:	6530	3	7	12	25000


> New Y[]: 
	
	 2  3  1  0  0  0  0  0  0  0  1  0  1  1  0  0  1  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,42

## ITERATION 110 #######################


> Neighbours evaluated; 98
> Selected Move:	6510	3	16	5	25500


> New Y[]: 
	
	 2  3  1  0  0  1  0  0  0  0  1  0  1  1  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0  0  0  0 
 > pw :0,425

## ITERATION 111 #######################


> Neighbours evaluated; 62
> Selected Move:	6510	3	5	6	25000


> New Y[]: 
	
	 2  3  1  0  0  0  1  0  0  0  1  0  1  1  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,43

## ITERATION 112 #######################


> Neighbours evaluated; 63
> Selected Move:	6510	3	2	3	25000


> New Y[]: 
	
	 2  3  0  1  0  0  1  0  0  0  1  0  1  1  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,435

## ITERATION 113 #######################


> Neighbours evaluated; 68
> Selected Move:	6510	3	3	8	23500


> New Y[]: 
	
	 2  3  0  0  0  0  1  0  1  0  1  0  1  1  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,44

## ITERATION 114 #######################


> Neighbours evaluated; 69
> Selected Move:	6530	3	6	19	25000


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  1  0  1  0  1  1  0  0  0  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  1  0  0  1  0  0  0  0  0  0 
 > pw :0,435

## ITERATION 115 #######################


> Neighbours evaluated; 98
> Selected Move:	6530	3	13	4	24500


> New Y[]: 
	
	 2  3  0  0  1  0  0  0  1  0  1  0  1  0  0  0  0  0  0  1 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0 
 > pw :0,43

## ITERATION 116 #######################


> Neighbours evaluated; 97
> Selected Move:	6475	3	12	13	25500


> New Y[]: 
	
	 2  3  0  0  1  0  0  0  1  0  1  0  0  1  0  0  0  0  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,425

## ITERATION 117 #######################


> Neighbours evaluated; 93
> Selected Move:	6390	3	19	5	24500


> New Y[]: 
	
	 2  3  0  0  1  1  0  0  1  0  1  0  0  1  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0  1  0  0  0  0  0  0  0  0  0 
 > pw :0,42

## ITERATION 118 #######################


> Neighbours evaluated; 75
> Selected Move:	6490	3	4	7	24500


> New Y[]: 
	
	 2  3  0  0  0  1  0  1  1  0  1  0  0  1  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  1  0  0  1  0  0  0  0  0  0 
 > pw :0,415

## ITERATION 119 #######################


> Neighbours evaluated; 62
> Selected Move:	6490	3	13	4	24000


> New Y[]: 
	
	 2  3  0  0  1  1  0  1  1  0  1  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0 
 > pw :0,41

## ITERATION 120 #######################


> Neighbours evaluated; 87
> Selected Move:	6490	3	4	12	23500


> New Y[]: 
	
	 2  3  0  0  0  1  0  1  1  0  1  0  1  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0  0  0  0 
 > pw :0,405

## ITERATION 121 #######################


> Neighbours evaluated; 60
> Selected Move:	6490	3	1	17	25000


> New Y[]: 
	
	 2  0  0  0  0  1  0  1  1  0  1  0  1  0  0  0  0  3  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0  0  0  0 
 > pw :0,4

## ITERATION 122 #######################


> Neighbours evaluated; 73
> Selected Move:	6700	3	7	4	25000


> New Y[]: 
	
	 2  0  0  0  1  1  0  0  1  0  1  0  1  0  0  0  0  3  0  0 


> New S[]: 
	
	 1  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,395

## ITERATION 123 #######################


> Neighbours evaluated; 86
> Selected Move:	6530	3	5	6	24500


> New Y[]: 
	
	 2  0  0  0  1  0  1  0  1  0  1  0  1  0  0  0  0  3  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0  0  0  0 
 > pw :0,39

## ITERATION 124 #######################


> Neighbours evaluated; 93
> Selected Move:	6600	3	17	5	24700


> New Y[]: 
	
	 2  0  0  0  1  3  1  0  1  0  1  0  1  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,385

## ITERATION 125 #######################


> Neighbours evaluated; 46
> Selected Move:	6600	4	5	4	23600


> New Y[]: 
	
	 2  0  0  0  3  1  1  0  1  0  1  0  1  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,38

## ITERATION 126 #######################


> Neighbours evaluated; 68
> Selected Move:	6600	4	4	8	24500


> New Y[]: 
	
	 2  0  0  0  1  1  1  0  3  0  1  0  1  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,375

## ITERATION 127 #######################


> Neighbours evaluated; 50
> Selected Move:	6600	4	8	12	24100


> New Y[]: 
	
	 2  0  0  0  1  1  1  0  1  0  1  0  3  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,37

## ITERATION 128 #######################


> Neighbours evaluated; 66
> Selected Move:	6600	3	12	14	24300


> New Y[]: 
	
	 2  0  0  0  1  1  1  0  1  0  1  0  0  0  3  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0  0  0  0  0  1  0  0  0  0  0 
 > pw :0,365

## ITERATION 129 #######################


> Neighbours evaluated; 54
> Selected Move:	6600	4	14	4	24600


> New Y[]: 
	
	 2  0  0  0  3  1  1  0  1  0  1  0  0  0  1  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0  0  0  0  0  1  0  0  0  0  0 
 > pw :0,36

## ITERATION 130 #######################


> Neighbours evaluated; 62
> Selected Move:	6420	4	4	8	25500


> New Y[]: 
	
	 2  0  0  0  1  1  1  0  3  0  1  0  0  0  1  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0  0  0  0  0  1  0  0  0  0  0 
 > pw :0,355

## ITERATION 131 #######################


> Neighbours evaluated; 55
> Selected Move:	6352	4	8	5	25700


> New Y[]: 
	
	 2  0  0  0  1  3  1  0  1  0  1  0  0  0  1  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0  0  0  0  0  1  0  0  0  0  0 
 > pw :0,35

## ITERATION 132 #######################


> Neighbours evaluated; 51
> Selected Move:	6355	3	5	17	25500


> New Y[]: 
	
	 2  0  0  0  1  0  1  0  1  0  1  0  0  0  1  0  0  3  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  1  0  0  0  1  0  0  0  0  0 
 > pw :0,345

## ITERATION 133 #######################


> Neighbours evaluated; 90
> Selected Move:	6475	3	6	5	26000


> New Y[]: 
	
	 2  0  0  0  1  1  0  0  1  0  1  0  0  0  1  0  0  3  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  1  0  0  0  1  0  0  0  0  0 
 > pw :0,34

## ITERATION 134 #######################


> Neighbours evaluated; 88
> Selected Move:	6320	3	14	7	25500


> New Y[]: 
	
	 2  0  0  0  1  1  0  1  1  0  1  0  0  0  0  0  0  3  0  0 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0 
 > pw :0,345

## ITERATION 135 #######################


> Neighbours evaluated; 99
> Selected Move:	6340	3	5	16	25000


> New Y[]: 
	
	 2  0  0  0  1  0  0  1  1  0  1  0  0  0  0  0  1  3  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0 
 > pw :0,35

## ITERATION 136 #######################


> Neighbours evaluated; 86
> Selected Move:	6455	3	4	13	25500


> New Y[]: 
	
	 2  0  0  0  0  0  0  1  1  0  1  0  0  1  0  0  1  3  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0  1  0  0  0  0  0  0  0  0  0 
 > pw :0,355

## ITERATION 137 #######################


> Neighbours evaluated; 93
> Selected Move:	6422	3	17	5	25700


> New Y[]: 
	
	 2  0  0  0  0  3  0  1  1  0  1  0  0  1  0  0  1  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0  1  0  0  0  0  0  0  0  0  0 
 > pw :0,36

## ITERATION 138 #######################


> Neighbours evaluated; 69
> Selected Move:	6670	4	5	13	25000


> New Y[]: 
	
	 2  0  0  0  0  1  0  1  1  0  1  0  0  3  0  0  1  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0  1  0  0  0  0  0  0  0  0  0 
 > pw :0,365

## ITERATION 139 #######################


> Neighbours evaluated; 77
> Selected Move:	6760	3	5	6	24500


> New Y[]: 
	
	 2  0  0  0  0  0  1  1  1  0  1  0  0  3  0  0  1  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0  1  0  0  0  0  0  0  0  0  0 
 > pw :0,37

## ITERATION 140 #######################


> Neighbours evaluated; 81
> Selected Move:	6760	4	13	7	24900


> New Y[]: 
	
	 2  0  0  0  0  0  1  3  1  0  1  0  0  1  0  0  1  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0  1  0  0  0  0  0  0  0  0  0 
 > pw :0,375

## ITERATION 141 #######################


> Neighbours evaluated; 78
> Selected Move:	6760	4	7	8	25000


> New Y[]: 
	
	 2  0  0  0  0  0  1  1  3  0  1  0  0  1  0  0  1  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0  1  0  0  0  0  0  0  0  0  0 
 > pw :0,38

## ITERATION 142 #######################


> Neighbours evaluated; 81
> Selected Move:	6764	3	8	9	25200


> New Y[]: 
	
	 2  0  0  0  0  0  1  1  0  3  1  0  0  1  0  0  1  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,385

## ITERATION 143 #######################


> Neighbours evaluated; 81
> Selected Move:	6648	3	9	2	25500


> New Y[]: 
	
	 2  0  3  0  0  0  1  1  0  0  1  0  0  1  0  0  1  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0  1  0  0  0  0  0  0  0  0  0 
 > pw :0,39

## ITERATION 144 #######################


> Neighbours evaluated; 80
> Selected Move:	6540	3	7	12	25000


> New Y[]: 
	
	 2  0  3  0  0  0  1  0  0  0  1  0  1  1  0  0  1  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,385

## ITERATION 145 #######################


> Neighbours evaluated; 96
> Selected Move:	6540	3	2	9	24700


> New Y[]: 
	
	 2  0  0  0  0  0  1  0  0  3  1  0  1  1  0  0  1  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0 
 > pw :0,38

## ITERATION 146 #######################


> Neighbours evaluated; 101
> Selected Move:	6624	3	12	14	25700


> New Y[]: 
	
	 2  0  0  0  0  0  1  0  0  3  1  0  0  1  1  0  1  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1  0  0  0  0  1  0  0  0  0  0 
 > pw :0,375

## ITERATION 147 #######################


> Neighbours evaluated; 97
> Selected Move:	6590	4	9	14	25800


> New Y[]: 
	
	 2  0  0  0  0  0  1  0  0  1  1  0  0  1  3  0  1  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1  0  0  0  0  1  0  0  0  0  0 
 > pw :0,37

## ITERATION 148 #######################


> Neighbours evaluated; 96
> Selected Move:	6720	3	9	8	24300


> New Y[]: 
	
	 2  0  0  0  0  0  1  0  1  0  1  0  0  1  3  0  1  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,365

## ITERATION 149 #######################


> Neighbours evaluated; 97
> Selected Move:	6760	3	14	11	24700


> New Y[]: 
	
	 2  0  0  0  0  0  1  0  1  0  1  3  0  1  0  0  1  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  1  1  0  0  0  0  0  0  0  0 
 > pw :0,36

## ITERATION 150 #######################


> Neighbours evaluated; 87
> Selected Move:	6760	4	11	13	25000


> New Y[]: 
	
	 2  0  0  0  0  0  1  0  1  0  1  1  0  3  0  0  1  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  1  1  0  0  0  0  0  0  0  0 
 > pw :0,355

## ITERATION 151 #######################


> Neighbours evaluated; 88
> Selected Move:	6720	3	11	14	25000


> New Y[]: 
	
	 2  0  0  0  0  0  1  0  1  0  1  0  0  3  1  0  1  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,35

## ITERATION 152 #######################


> Neighbours evaluated; 97
> Selected Move:	6630	3	14	3	25000


> New Y[]: 
	
	 2  0  0  1  0  0  1  0  1  0  1  0  0  3  0  0  1  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  1  0  0  1  0  0  0  0  0  0 
 > pw :0,345

## ITERATION 153 #######################


> Neighbours evaluated; 83
> Selected Move:	6630	4	13	3	24800


> New Y[]: 
	
	 2  0  0  3  0  0  1  0  1  0  1  0  0  1  0  0  1  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  1  0  0  1  0  0  0  0  0  0 
 > pw :0,34

## ITERATION 154 #######################


> Neighbours evaluated; 86
> Selected Move:	6558	3	6	5	25300


> New Y[]: 
	
	 2  0  0  3  0  1  0  0  1  0  1  0  0  1  0  0  1  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  1  0  0  1  0  0  0  0  0  0 
 > pw :0,335

## ITERATION 155 #######################


> Neighbours evaluated; 83
> Selected Move:	6670	3	3	14	24800


> New Y[]: 
	
	 2  0  0  0  0  1  0  0  1  0  1  0  0  1  3  0  1  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  1  0  0  0  1  0  0  0  0  0 
 > pw :0,33

## ITERATION 156 #######################


> Neighbours evaluated; 99
> Selected Move:	6604	3	14	11	25200


> New Y[]: 
	
	 2  0  0  0  0  1  0  0  1  0  1  3  0  1  0  0  1  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  1  1  0  0  0  0  0  0  0  0 
 > pw :0,325

## ITERATION 157 #######################


> Neighbours evaluated; 92
> Selected Move:	6540	3	11	7	25400


> New Y[]: 
	
	 2  0  0  0  0  1  0  3  1  0  1  0  0  1  0  0  1  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0  1  0  0  0  0  0  0  0  0  0 
 > pw :0,32

## ITERATION 158 #######################


> Neighbours evaluated; 80
> Selected Move:	6510	4	7	8	25500


> New Y[]: 
	
	 2  0  0  0  0  1  0  1  3  0  1  0  0  1  0  0  1  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0  1  0  0  0  0  0  0  0  0  0 
 > pw :0,315

## ITERATION 159 #######################


> Neighbours evaluated; 85
> Selected Move:	6580	3	8	9	25700


> New Y[]: 
	
	 2  0  0  0  0  1  0  1  0  3  1  0  0  1  0  0  1  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  1  0  0  0  0  0  0  0  0  0  0 
 > pw :0,32

## ITERATION 160 #######################


> Neighbours evaluated; 85
> Selected Move:	6506	3	7	12	25200


> New Y[]: 
	
	 2  0  0  0  0  1  0  0  0  3  1  0  1  1  0  0  1  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0 
 > pw :0,325

## ITERATION 161 #######################


> Neighbours evaluated; 103
> Selected Move:	6703	3	16	18	25700


> New Y[]: 
	
	 2  0  0  0  0  1  0  0  0  3  1  0  1  1  0  0  0  0  1  0 


> New S[]: 
	
	 1  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,33

## ITERATION 162 #######################


> Neighbours evaluated; 96
> Selected Move:	6624	3	5	6	25200


> New Y[]: 
	
	 2  0  0  0  0  0  1  0  0  3  1  0  1  1  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0 
 > pw :0,335

## ITERATION 163 #######################


> Neighbours evaluated; 103
> Selected Move:	6553	3	18	5	25200


> New Y[]: 
	
	 2  0  0  0  0  1  1  0  0  3  1  0  1  1  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0 
 > pw :0,34

## ITERATION 164 #######################


> Neighbours evaluated; 74
> Selected Move:	6600	3	13	4	24700


> New Y[]: 
	
	 2  0  0  0  1  1  1  0  0  3  1  0  1  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1  0  0  1  0  0  0  0  0  0  0 
 > pw :0,345

## ITERATION 165 #######################


> Neighbours evaluated; 69
> Selected Move:	6600	3	9	2	25000


> New Y[]: 
	
	 2  0  3  0  1  1  1  0  0  0  1  0  1  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,35

## ITERATION 166 #######################


> Neighbours evaluated; 54
> Selected Move:	6565	4	2	4	25100


> New Y[]: 
	
	 2  0  1  0  3  1  1  0  0  0  1  0  1  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,355

## ITERATION 167 #######################


> Neighbours evaluated; 59
> Selected Move:	6565	3	2	3	25100


> New Y[]: 
	
	 2  0  0  1  3  1  1  0  0  0  1  0  1  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,36

## ITERATION 168 #######################


> Neighbours evaluated; 77
> Selected Move:	6584	3	5	18	25100


> New Y[]: 
	
	 2  0  0  1  3  0  1  0  0  0  1  0  1  0  0  0  0  0  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,365

## ITERATION 169 #######################


> Neighbours evaluated; 99
> Selected Move:	6511	4	4	3	25300


> New Y[]: 
	
	 2  0  0  3  1  0  1  0  0  0  1  0  1  0  0  0  0  0  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,37

## ITERATION 170 #######################


> Neighbours evaluated; 101
> Selected Move:	6489	3	18	5	25300


> New Y[]: 
	
	 2  0  0  3  1  1  1  0  0  0  1  0  1  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,375

## ITERATION 171 #######################


> Neighbours evaluated; 85
> Selected Move:	6375	4	3	12	25600


> New Y[]: 
	
	 2  0  0  1  1  1  1  0  0  0  1  0  3  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,38

## ITERATION 172 #######################


> Neighbours evaluated; 78
> Selected Move:	6392	3	5	18	25600


> New Y[]: 
	
	 2  0  0  1  1  0  1  0  0  0  1  0  3  0  0  0  0  0  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,385

## ITERATION 173 #######################


> Neighbours evaluated; 98
> Selected Move:	6267	3	4	13	26100


> New Y[]: 
	
	 2  0  0  1  0  0  1  0  0  0  1  0  3  1  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,39

## ITERATION 174 #######################


> Neighbours evaluated; 85
> Selected Move:	6390	3	3	8	24600


> New Y[]: 
	
	 2  0  0  0  0  0  1  0  1  0  1  0  3  1  0  0  0  0  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,395

## ITERATION 175 #######################


> Neighbours evaluated; 98
> Selected Move:	6480	3	18	5	24600


> New Y[]: 
	
	 2  0  0  0  0  1  1  0  1  0  1  0  3  1  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0  0  0  0 
 > pw :0,4

## ITERATION 176 #######################


> Neighbours evaluated; 64
> Selected Move:	6480	4	12	8	25000


> New Y[]: 
	
	 2  0  0  0  0  1  1  0  3  0  1  0  1  1  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0  0  0  0 
 > pw :0,405

## ITERATION 177 #######################


> Neighbours evaluated; 55
> Selected Move:	6480	4	8	13	24500


> New Y[]: 
	
	 2  0  0  0  0  1  1  0  1  0  1  0  1  3  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0  0  0  0 
 > pw :0,41

## ITERATION 178 #######################


> Neighbours evaluated; 67
> Selected Move:	6398	4	13	5	25200


> New Y[]: 
	
	 2  0  0  0  0  3  1  0  1  0  1  0  1  1  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0  0  0  0 
 > pw :0,415

## ITERATION 179 #######################


> Neighbours evaluated; 56
> Selected Move:	6520	3	5	17	25000


> New Y[]: 
	
	 2  0  0  0  0  0  1  0  1  0  1  0  1  1  0  0  0  3  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0  0  0  0 
 > pw :0,42

## ITERATION 180 #######################


> Neighbours evaluated; 93
> Selected Move:	6430	3	6	5	25500


> New Y[]: 
	
	 2  0  0  0  0  1  0  0  1  0  1  0  1  1  0  0  0  3  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0  0  0  0 
 > pw :0,425

## ITERATION 181 #######################


> Neighbours evaluated; 94
> Selected Move:	6260	3	5	16	25000


> New Y[]: 
	
	 2  0  0  0  0  0  0  0  1  0  1  0  1  1  0  0  1  3  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0 
 > pw :0,42

## ITERATION 182 #######################


> Neighbours evaluated; 91
> Selected Move:	6260	3	17	1	23500


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  1  0  1  0  1  1  0  0  1  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,415

## ITERATION 183 #######################


> Neighbours evaluated; 103
> Selected Move:	6383	3	10	3	25500


> New Y[]: 
	
	 2  3  0  1  0  0  0  0  1  0  0  0  1  1  0  0  1  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,41

## ITERATION 184 #######################


> Neighbours evaluated; 71
> Selected Move:	6560	3	13	4	25000


> New Y[]: 
	
	 2  3  0  1  1  0  0  0  1  0  0  0  1  0  0  0  1  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,405

## ITERATION 185 #######################


> Neighbours evaluated; 101
> Selected Move:	6410	3	12	10	24000


> New Y[]: 
	
	 2  3  0  1  1  0  0  0  1  0  1  0  0  0  0  0  1  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,4

## ITERATION 186 #######################


> Neighbours evaluated; 108
> Selected Move:	6350	3	16	5	24500


> New Y[]: 
	
	 2  3  0  1  1  1  0  0  1  0  1  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0 
 > pw :0,395

## ITERATION 187 #######################


> Neighbours evaluated; 86
> Selected Move:	6440	3	3	11	24500


> New Y[]: 
	
	 2  3  0  0  1  1  0  0  1  0  1  1  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0 
 > pw :0,39

## ITERATION 188 #######################


> Neighbours evaluated; 77
> Selected Move:	6440	3	4	12	24000


> New Y[]: 
	
	 2  3  0  0  0  1  0  0  1  0  1  1  1  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0  0  0  0 
 > pw :0,385

## ITERATION 189 #######################


> Neighbours evaluated; 84
> Selected Move:	6440	3	12	13	25000


> New Y[]: 
	
	 2  3  0  0  0  1  0  0  1  0  1  1  0  1  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  1  0  0  1  0  0  0  0  0  0 
 > pw :0,38

## ITERATION 190 #######################


> Neighbours evaluated; 77
> Selected Move:	6420	3	8	12	25500


> New Y[]: 
	
	 2  3  0  0  0  1  0  0  0  0  1  1  1  1  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  1  0  0  1  0  0  0  0  0  0 
 > pw :0,375

## ITERATION 191 #######################


> Neighbours evaluated; 76
> Selected Move:	6390	3	11	4	25000


> New Y[]: 
	
	 2  3  0  0  1  1  0  0  0  0  1  0  1  1  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0  0  0  0 
 > pw :0,37

## ITERATION 192 #######################


> Neighbours evaluated; 81
> Selected Move:	6380	3	13	14	25000


> New Y[]: 
	
	 2  3  0  0  1  1  0  0  0  0  1  0  1  0  1  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0 
 > pw :0,365

## ITERATION 193 #######################


> Neighbours evaluated; 83
> Selected Move:	6415	3	12	2	26000


> New Y[]: 
	
	 2  3  1  0  1  1  0  0  0  0  1  0  0  0  1  0  0  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0 
 > pw :0,36

## ITERATION 194 #######################


> Neighbours evaluated; 69
> Selected Move:	6420	3	2	9	26000


> New Y[]: 
	
	 2  3  0  0  1  1  0  0  0  1  1  0  0  0  1  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1  0  0  0  0  1  0  0  0  0  0 
 > pw :0,355

## ITERATION 195 #######################


> Neighbours evaluated; 74
> Selected Move:	6568	3	4	13	26500


> New Y[]: 
	
	 2  3  0  0  0  1  0  0  0  1  1  0  0  1  1  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  1  0  0  0  1  0  0  0  0  0 
 > pw :0,35

## ITERATION 196 #######################


> Neighbours evaluated; 74
> Selected Move:	6530	3	5	16	26000


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  0  1  1  0  0  1  1  0  1  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1  0  0  0  0  1  0  0  0  0  0 
 > pw :0,355

## ITERATION 197 #######################


> Neighbours evaluated; 108
> Selected Move:	6505	3	16	6	26000


> New Y[]: 
	
	 2  3  0  0  0  0  1  0  0  1  1  0  0  1  1  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  1  0  0  1  0  0  0  0  0  0 
 > pw :0,36

## ITERATION 198 #######################


> Neighbours evaluated; 79
> Selected Move:	6510	3	14	12	25000


> New Y[]: 
	
	 2  3  0  0  0  0  1  0  0  1  1  0  1  1  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0 
 > pw :0,365

## ITERATION 199 #######################


> Neighbours evaluated; 77
> Selected Move:	6490	3	13	4	24500


> New Y[]: 
	
	 2  3  0  0  1  0  1  0  0  1  1  0  1  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1  0  0  1  0  0  0  0  0  0  0 
 > pw :0,37

## ITERATION 200 #######################


> Neighbours evaluated; 75
> Selected Move:	6490	3	9	2	24500


> New Y[]: 
	
	 2  3  1  0  1  0  1  0  0  0  1  0  1  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,375

## ITERATION 201 #######################


> Neighbours evaluated; 67
> Selected Move:	6490	3	2	3	24500


> New Y[]: 
	
	 2  3  0  1  1  0  1  0  0  0  1  0  1  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,38

## ITERATION 202 #######################


> Neighbours evaluated; 90
> Selected Move:	6570	3	6	18	25000


> New Y[]: 
	
	 2  3  0  1  1  0  0  0  0  0  1  0  1  0  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,385

## ITERATION 203 #######################


> Neighbours evaluated; 107
> Selected Move:	6398	3	4	13	25500


> New Y[]: 
	
	 2  3  0  1  0  0  0  0  0  0  1  0  1  1  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,39

## ITERATION 204 #######################


> Neighbours evaluated; 96
> Selected Move:	6395	3	3	9	25500


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  0  1  1  0  1  1  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0 
 > pw :0,395

## ITERATION 205 #######################


> Neighbours evaluated; 101
> Selected Move:	6390	3	13	4	25000


> New Y[]: 
	
	 2  3  0  0  1  0  0  0  0  1  1  0  1  0  0  0  0  0  1  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,39

## ITERATION 206 #######################


> Neighbours evaluated; 106
> Selected Move:	6340	3	18	16	24500


> New Y[]: 
	
	 2  3  0  0  1  0  0  0  0  1  1  0  1  0  0  0  1  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,385

## ITERATION 207 #######################


> Neighbours evaluated; 109
> Selected Move:	6400	3	12	7	25000


> New Y[]: 
	
	 2  3  0  0  1  0  0  1  0  1  1  0  0  0  0  0  1  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,38

## ITERATION 208 #######################


> Neighbours evaluated; 103
> Selected Move:	6440	3	9	2	25000


> New Y[]: 
	
	 2  3  1  0  1  0  0  1  0  0  1  0  0  0  0  0  1  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,375

## ITERATION 209 #######################


> Neighbours evaluated; 105
> Selected Move:	6380	3	7	12	24500


> New Y[]: 
	
	 2  3  1  0  1  0  0  0  0  0  1  0  1  0  0  0  1  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,37

## ITERATION 210 #######################


> Neighbours evaluated; 106
> Selected Move:	6330	3	4	3	25000


> New Y[]: 
	
	 2  3  1  1  0  0  0  0  0  0  1  0  1  0  0  0  1  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,365

## ITERATION 211 #######################


> Neighbours evaluated; 89
> Selected Move:	6320	3	3	7	24500


> New Y[]: 
	
	 2  3  1  0  0  0  0  1  0  0  1  0  1  0  0  0  1  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,36
________________________________________________________________

Best solution found: 6880
Run Termination time: 03.02.2010 21:15:06
Run duration: 00:04:02.5937500
________________________________________________________________
